Theory of (1+1) ES on SPHERE Revisited
نویسندگان
چکیده
The theory of evolutionary algorithms on continuous space gravitates around the evolution strategy with one individual, adaptive mutation and elitist selection, optimizing symmetric, quadratic SPHERE function. classic, normal consists three main building-blocks: i) a two-term formula for local (constant mutation) expected progress; ii) an exponential global behavior (adaptive algorithm; iii) linear convergence time respect to both dimension n (logarithm of) initial distance optimum. We show that results still hold if we replace uniform inside sphere also sum two uniforms. That makes case important conclusion: algorithm is not consequence mutation, but selection 1/5 success rule. A simplified version 1/5-rule allows intuitive representation algorithm, as sequence constant-mutation, independent identical (expected) length cycles.
منابع مشابه
Es-13854 1..11
Civil engineering is changing and needs to change more. This paper attempts to put the evolution of technology and the development of engineering into its historical context, and with it the emergence of problems whose solutions extend beyond technology alone if they are to achieve systems-level solutions. The balancing of economic, social and environmental objectives, both now and into the fut...
متن کاملSphere packings revisited
In this paper we survey most of the recent and often surprising results on packings of congruent spheres in d-dimensional spaces of constant curvature. The topics discussed are as follows: Hadwiger numbers of convex bodies and kissing numbers of spheres; Touching numbers of convex bodies; Newton numbers of convex bodies; One-sided Hadwiger and kissing numbers; Contact graphs of finite packings ...
متن کاملContact graphs of unit sphere packings revisited
The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing elements touch each other. One of the most basic questions on contact graphs is to find the maximum number of edges that a contact graph of a packing of n unit ...
متن کاملD=11 Supergravity Revisited
I discuss two novel results in D=11 Supergravity. The first establishes, in two complementary ways, a no-go theorem that, in contrast to all D<11, a cosmological extension of the theory does not exist. The second deals with the structure of (on-shell) four-point invariants. These are important both for establishing existence of the lowest (2-loop) order candidate counter-terms in the theory pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2023
ISSN: ['1941-0026', '1089-778X']
DOI: https://doi.org/10.1109/tevc.2022.3217524